Search Results/Filters    

Filters

Year

Banks



Expert Group











Full-Text


Issue Info: 
  • Year: 

    2013
  • Volume: 

    44
Measures: 
  • Views: 

    159
  • Downloads: 

    93
Abstract: 

THIS PAPER SUGGESTS AN ITERATIVE CONVERGENT METHOD FOR FINDING A DISCRETE APPROXIMATION TO THE NONDOMINATED SET OF A MULTI OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEM. THE METHOD IS ORGANIZED SO THAT THE RESULTING APPROXIMATION SET HAS ACCEPTABLE QUALITY MEASURES. THE RESULTING SET IS AN E -APPROXIMATION TO THE NONDOMINATED SET WHERE E IS A TOLERANCE VECTOR. ALSO, IT DOES NOT GENERATE REDUNDANT INFORMATION.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 159

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 93
Issue Info: 
  • Year: 

    2002
  • Volume: 

    -
  • Issue: 

    -
  • Pages: 

    603-607
Measures: 
  • Citations: 

    1
  • Views: 

    167
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 167

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

OLIVEIRA L. | SARAMAGO S.

Issue Info: 
  • Year: 

    2010
  • Volume: 

    32
  • Issue: 

    1
  • Pages: 

    94-105
Measures: 
  • Citations: 

    1
  • Views: 

    199
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 199

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    621
  • Volume: 

    13
  • Issue: 

    1
  • Pages: 

    105-120
Measures: 
  • Citations: 

    0
  • Views: 

    5
  • Downloads: 

    0
Abstract: 

In this paper, we focus on the utilization of the feasible value constraint technique to address multiobjective optimization PROBLEMS (MOPs). It is attempted to overcome certain drawbacks associated with this method, such as restrictions on functions and weights, inflexibility in constraints, and challenges in assessing proper efficiency. To accomplish this, we propose an improved version of the feasible value constraint technique. Then, by incorporating approximate solutions, we establish connections between $\varepsilon$-(weakly, properly) efficient points in a general MOP and $\epsilon$-optimal solutions to the scalarization problem.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 5

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2020
  • Volume: 

    17
  • Issue: 

    3
  • Pages: 

    19-31
Measures: 
  • Citations: 

    0
  • Views: 

    412
  • Downloads: 

    146
Abstract: 

In this paper we study fuzzy multiobjective optimization PROBLEMS defined for n variables. Based on a new p-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 412

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 146 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2015
  • Volume: 

    46
Measures: 
  • Views: 

    143
  • Downloads: 

    61
Abstract: 

IN THIS PAPER, WE PROPOSE A NEWTON-TYPE ALGORITHM FOR NONCONVEX MULTIOBJECTIVE OPTIMIZATION PROBLEMS. THE PRESENTED TERMINATES, WHEN THE TERMINATION CONDITIONS ARE SATISFIED. CONVERGENCE OF THE ALGORITHM IS CONSIDERED.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 143

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 61
Issue Info: 
  • Year: 

    2013
  • Volume: 

    5
Measures: 
  • Views: 

    141
  • Downloads: 

    61
Abstract: 

IN THIS PAPER, WE ARE GOING TO PROPOSE A GLOBAL INTERACTIVE ALGORITHM ENABLING THE DECISION MAKER (DM) TO APPLY FREELY SEVERAL CONVENIENT METHODS WHICH BEST FIT HIS/HER PREFERENCES. TO THIS END, A GENERAL SCALARIZING PROBLEM FOR MULTI-OBJECTIVE PROGRAMMING IS SUGGESTED AND THE RELATION BETWEEN OPTIMAL SOLUTIONS OF THE INTRODUCED SCALARIZED PROBLEM AND (WEAKLY, PROPERLY) EFFICIENT SOLUTIONS OF THE MAIN MULTI-OBJECTIVE OPTIMIZATION PROBLEM (MOP) IS DISCUSSED. UTILIZING THE PROPOSED SCALARIZED PROBLEM, WE SUGGEST AN INTERACTIVE METHOD THAT ENABLES THE DM TO SPECIFY HIS/HER PREFERENCES IN DIFFERENT WAYS WITH CAPABILITY TO CHANGE HIS/HER PREFERENCES ANYTIME DURING THE ITERATIONS OF THE ALGORITHM.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 141

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 61
Author(s): 

Alavi Hejazi M.

Issue Info: 
  • Year: 

    2018
  • Volume: 

    12
  • Issue: 

    1
  • Pages: 

    25-39
Measures: 
  • Citations: 

    0
  • Views: 

    211
  • Downloads: 

    156
Abstract: 

In this paper, we consider a nonsmooth multiobjective problem with equilibrium constraints (MPEC). We present three constraint qualifications (CQs) and investigate their relations. Furthermore, we derive two types of necessary optimality conditions under these CQs.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 211

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 156 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2017
  • Volume: 

    9
  • Issue: 

    3
  • Pages: 

    195-202
Measures: 
  • Citations: 

    0
  • Views: 

    666
  • Downloads: 

    138
Abstract: 

In this paper, the concept of pseudoconvexity and quasiconvexity for continuous -time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming PROBLEMS are presented. Finally, some characterizations of the solution sets of a single-valued continuous-time programming problem are obtained.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 666

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 138 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2020
  • Volume: 

    11
  • Issue: 

    1
  • Pages: 

    439-451
Measures: 
  • Citations: 

    0
  • Views: 

    180
  • Downloads: 

    87
Abstract: 

The motivation behind this article is to generalize a new type of class of nondifferentiable multiob-jective fractional programming problem in which each component of objective functions contains a term including the support function of a compact convex set. For a differentiable function, we con-sider the class of pseudoquasi /strictly pseudoquasi/weak strictly pseudoquasi/quasistrictly pseudo (V;  ;  )-bonvex-type-I. Further, we formulate uni ed (mixed type) dual models and derive duality relations under aforesaid assumptions.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 180

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 87 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button